Game Over

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interdependent Security Game Design over Constrained Linear Influence Networks

In today's highly interconnected networks, security of the entities are often interdependent. This means security decisions of the agents are not only influenced by their own costs and constraints, but also are affected by their neighbors’ decisions. Game theory provides a rich set of tools to analyze such influence networks. In the game model, players try to maximize their utilities through se...

متن کامل

Bargaining over time in ultimatum game experiments

We report the first ultimatum game experiment with bargaining over waiting time. The experiment was created to avoid effects of windfall gains. In contrast to donated money, time is not endowed by the experimenter and implies a natural loss to the subjects. This allows for a better measurement of the inherent conflict in the ultimatum game. We implemented three anonymity conditions; one baselin...

متن کامل

The Liar Game Over an Arbitrary Channel

We introduce and analyze a liar game in which t-ary questions are asked and the responder may lie at most k times. As an additional constraint, there is an arbitrary but prescribed list (the channel) of permissible types of lies. For any fixed t, k, and channel, we determine the exact asymptotics of the solution when the number of queries goes to infinity.

متن کامل

Game-Tree Search over High-Level Game States in RTS Games

From an AI point of view, Real-Time Strategy (RTS) games are hard because they have enormous state spaces, they are real-time and partially observable. In this paper, we present an approach to deploy gametree search in RTS games by using game state abstraction. We propose a high-level abstract representation of the game state, that significantly reduces the branching factor when used for game-t...

متن کامل

Game Over: Black to Play and Draw in Checkers

In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×10 positions, and because of computer capabilities of the time. Nevertheless the work continued, with the final calculation completing in 2007. The result? Perfect play by both sides leads to a draw. Checkers is the largest popular game that has been solved to date.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Heythrop Journal

سال: 2017

ISSN: 0018-1196

DOI: 10.1111/heyj.12655